Mechanical verification of distributed algorithms in higher-order logic
نویسندگان
چکیده
منابع مشابه
Mechanical Verification of Distributed Algorithms in Higher-Order Logic
The only practical way to verify the correctness of distributed algorithms with a high degree of conndence is to construct machine-checked, formal correctness proofs. In this paper we explain how to do so using HOL|an interactive proof assistant for higher-order logic developed by Gordon and others 18]. First, we describe how to build an infrastructure in HOL that supports reasoning about distr...
متن کاملMechanical Veri cation of Distributed Algorithms in Higher-Order Logic
The only practical way to verify the correctness of distributed algorithms with a high degree of con dence is to construct machine-checked, formal correctness proofs. In this paper we explain how to do so using HOL|an interactive proof assistant for higher-order logic developed by Gordon and others. First, we describe how to build an infrastructure in HOL that supports reasoning about distribut...
متن کاملHigher Order Logic and Hardware Verification
Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the obligation to support reading. What about now? Do you still love reading? Is reading only for you who have obligation? Absolutely not! We here offer you a new book enPDFd higher order logic and hardware ...
متن کاملVerification in Higher Order Logic of Mutual Exclusion Algorithm
In this work a mutual exclusion algorithm is mod-eled using Transition Assertions. The main feature of a mutual exclusion algorithm is to prevent simultaneous access of a shared resource by two or more systems. The speciication of the algorithm is a collection of transition assertions with each transition assertion containing a precondition and postcondition. The Transition Assertions model is ...
متن کاملPhD Progress Report, 2004 Mechanical Verification of Distributed Algorithms
We report the current state of the mechanisation, in Isabelle and HOL Light, of a paper [EM03] from the area of distributed algorithms. As well as the contribution of the mechanisation itself, we address several issues in theorem proving. For example, we have developed several tools which make the process of mechanisation easier, such as tools to handle context during a mechanisation, which gre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1995
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/38.2.152